منابع مشابه
Effective graph resistance
Article history: Available online 17 March 2011 Submitted by E.R. van Dam AMS classification: 05C50 05C81 05C90 94C05 94C15
متن کاملGraph Clustering using Effective Resistance
We design a polynomial time algorithm that for any weighted undirected graph G = (V,E,w) and sufficiently large δ > 1, partitions V into subsets V1, . . . , Vh for some h ≥ 1, such that • at most δ fraction of the weights are between clusters, i.e. w(E − ∪hi=1E(Vi)) . w(E) δ ; • the effective resistance diameter of each of the induced subgraphs G[Vi] is at most δ 3 times the average weighted de...
متن کاملMinimizing Effective Resistance of a Graph
The effective resistance between two nodes of a weighted graph is the electrical resistance seen between the nodes of a resistor network with branch conductances given by the edge weights. The effective resistance comes up in many applications and fields in addition to electrical network analysis, including, for example, Markov chains and continuous-time averaging networks. In this paper we stu...
متن کاملKemeny’s constant and the effective graph resistance
Article history: Received 18 July 2017 Accepted 5 September 2017 Available online 7 September 2017 Submitted by R. Brualdi MSC: 15A09 15A18 15A63
متن کاملGraph Effective Resistance and Distributed Control: Electrical Analogy and Scalability
We introduce the concept of matrix-valued effective resistance for undirected matrix-weighted graphs. These effective resistances are defined to be the square blocks that appear in the diagonal of the inverse of the matrix-weighted Dirichlet graph Laplacian matrix. However, they can also be obtained from a “generalized” electrical network that is constructed from the graph, and for which curren...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2011
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.02.024